منابع مشابه
Bichromatic Quadrangulations with Steiner Points
Abstract. Let P be a k colored point set in general position, k ≥ 2. A family of quadrilaterals with disjoint interiors Q1, . . . ,Qm is called a quadrangulation of P if V (Q1)∪ . . .∪V (Qm) = P , the edges of all Qi join points with different colors, and Q1 ∪ . . .∪Qm = Conv(P ). In general it is easy to see that not all k-colored point sets admit a quadrangulation; when they do, we call them ...
متن کاملBottleneck Bichromatic Plane Matching of Points
Given a set of n red points and n blue points in the plane, we are interested to match the red points with the blue points by straight line segments in such a way that the segments do not cross each other and the length of the longest segment is minimized. In general, this problem in NP-hard. We give exact solutions for some special cases of the input point set.
متن کاملExceptional points in bichromatic Wannier–Stark systems
The resonance spectrum of a tilted periodic quantum system for a bichromatic periodic potential is investigated. For such a bichromatic Wannier–Stark system, exceptional points, degeneracies of the spectrum, can be localized in parameter space by means of an efficient method for computing resonances. Berry phases and Petermann factors are analysed. Finally, the influence of a nonlinearity of th...
متن کاملBichromatic 2-Center of Pairs of Points
We study a class of geometric optimization problems closely related to the 2-center problem: Given a set S of n pairs of points, assign to each point a color (“red” or “blue”) so that each pair’s points are assigned different colors and a function of the radii of the minimum enclosing balls of the red points and the blue points, respectively, is optimized. In particular, we consider the problem...
متن کاملLattice 3-Polytopes with Few Lattice Points
This paper is intended as a first step in a program for a full algorithmic enumeration of lattice 3-polytopes. The program is based in the following two facts, that we prove: • For each n there is only a finite number of (equivalence classes of) 3polytopes of lattice width larger than one, where n is the number of lattice points. Polytopes of width one are infinitely many, but easy to classify....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series A
سال: 2000
ISSN: 0097-3165
DOI: 10.1006/jcta.1999.3047